package org.hot100_2;

public class leetcode238 {
    public  int [] productExceptSelf(int [] nums){

        int n = nums.length;
        int [] left = new int[n];
        int [] right = new  int [n];
        int [] ans = new int[n];

        left[0]=right[n-1]=1;

        for (int i = 1; i <n; i++) {
            left[i]=left[i-1]*nums[i-1];
        }

        for (int i = n-2; i >=0; i--) {
            right[i]=right[i+1]*nums[i+1];
        }

        for (int i = 0; i < n; i++) {
            ans[i]=left[i]*right[i];
        }


        return ans;
    }
}
